IsaPlanner: A Prototype Proof Planner in Isabelle Lucas Dixon and Jacques Fleuriot ?

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Theoretical computer science
• Mathematical logic
• Mathematics
• IsaPlanner
• Automated reasoning
• Isabelle
• Rippling
• Mathematical proof
• Interactive Theorem Proving
• Theorem
• Mathematical induction

Scheme-based Theorem Discovery and Concept Invention O. Montano-Rivasa , R. McCaslanda , L. Dixona , A. Bundya a School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street,

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Logic programming
• Logic in computer science
• Computability theory
• Algebraic topology
• Substitution
• Unification
• Lambda calculus
• Sheaf
• Scheme
• Combinatory logic
• Morphism of algebraic varieties

1 Potassco: The Potsdam Answer Set Solving Collection Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Schneider

Source URL: www.cs.uni-potsdam.de

• Logic programming
• NP-complete problems
• Operations research
• Constraint programming
• Answer set programming
• Logic in computer science
• Boolean satisfiability problem
• Algorithm
• Solver
• Stable model semantics
• AMPL
• Constraint satisfaction problem

Representing Streams in Second Order Logic (Coinduction and Coalgebra in Second Order Logic) Herman Geuvers Radboud University Nijmegen and

Source URL: www.cs.ru.nl

• Category theory
• Mathematics
• Theoretical computer science
• Software engineering
• Functional programming
• Computer programming
• Recursion
• F-coalgebra
• Coinduction
• Coalgebra
• Corecursion
• First-order logic

In: Journal of Logic, Language and Information, Counterfactuals and updates as inverse modalities Mark Ryan School of Computer Science. University of Birmingham, Birmingham B15 2TT,

Source URL: www.cs.bham.ac.uk

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Source URL: www.complexity.ethz.ch

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Automated theorem proving
• Logic in computer science
• Rules of inference
• Resolution
• Proof complexity
• Conflict-Driven Clause Learning
• Boolean algebra
• Exponential time hypothesis
• PP

Automated Verification of Shape, Size and Bag Properties via User-Defined Predicates in Separation Logic ∗ Wei-Ngan China , Cristina Davida , Huu Hai Nguyena , and Shengchao Qinb† a Department of Computer Science, N

Source URL: www.comp.nus.edu.sg

Languages for Computational Creativity Generative Art and Interactive Worlds (Full Presentation) Chris Martens Carnegie Mellon University

Source URL: popl-obt-2014.cs.brown.edu

• Logic
• Visual arts
• Abstraction
• Programming paradigms
• Non-classical logic
• Formal languages
• Grammar
• Logic in computer science
• Generative art
• Logic programming
• Linear logic
• Generative music

Rely-Guarantee References for Refinement Types Over Aliased Mutable Data Colin S. Gordon, Michael D. Ernst, and Dan Grossman University of Washington {csgordon,mernst,djg}@cs.washington.edu

Source URL: homes.cs.washington.edu

• Theoretical computer science
• Denotational semantics
• Logic in computer science
• Predicate
• Heap
• Linguistics

A Larger Decidable Semiunification Problem Brad Lushman University of Waterloo Gordon V. Cormack University of Waterloo

Source URL: plg.uwaterloo.ca

• Theoretical computer science
• Mathematical logic
• Logic
• Automated theorem proving
• Logic programming
• Logic in computer science
• Type theory
• Lambda calculus
• Substitution
• Symbol
• Directed acyclic graph
• Unification